The distribution of optimal strategies in symmetric zero-sum games

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Distribution of Optimal Strategies in Symmetric Zero-sum Games

Given a skew-symmetric matrix, the corresponding two-player symmetric zero-sum game is defined as follows: one player, the row player, chooses a row and the other player, the column player, chooses a column. The payoff of the row player is given by the corresponding matrix entry, the column player receives the negative of the row player. A randomized strategy is optimal if it guarantees an expe...

متن کامل

Pure strategy equilibria in symmetric two-player zero-sum games

We show that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for existence are provided. We point out that the class of symmetric two-player zero-sum games coincides with ...

متن کامل

Optimal strategies for equal-sum dice games

In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, σ) dice game, two players can independently choose a dice from a collection of hypothetical dice having n faces and with a total of σ eyes distributed over these faces. They independently roll their dice and the player showing the highest number of eyes wins (in case of a tie, none of the pl...

متن کامل

Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information

In stochastic games with perfect information, in each state at most one player has more than one action available. We propose two algorithms which find the uniform optimal strategies for zero-sum two-player stochastic games with perfect information. Such strategies are optimal for the long term average criterion as well. We prove the convergence for one algorithm, which presents a higher comple...

متن کامل

Synthesis of Strategies for Non-Zero-Sum Repeated Games

Title of dissertation: SYNTHESIS OF STRATEGIES FOR NON-ZERO-SUM REPEATED GAMES Tsz-Chiu Au, Doctor of Philosophy, 2008 Dissertation directed by: Professor Dana Nau Department of Computer Science There are numerous applications that involve two or more self-interested autonomous agents that repeatedly interact with each other in order to achieve a goal or maximize their utilities. This dissertat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games and Economic Behavior

سال: 2017

ISSN: 0899-8256

DOI: 10.1016/j.geb.2017.06.017